منابع مشابه
More Efficient Provably Secure Steganography
Steganography is the science of hiding the very presence of a secret message within a public communication channel. In Crypto 2002, Hopper, Langford, and von Ahn proposed the first complexitytheoretic definition and constructions of stegosystems. They later pointed out and corrected a flaw in one of their basic constructions. The correction, unfortunately, introduced a need for expensive errorc...
متن کاملEfficient and provably secure steganography
Steganography is the art of encoding secret messages into unsuspicious covertexts, such that an adversary cannot distinguish the resulting stegotexts from original covertexts. A covertext consists of a sequence of documents. Whereas a large amount of work has gone into practical implementations of steganography, mostly for multimedia data as covertexts, only few theoretical analyses exist. In t...
متن کاملProvably Secure Steganography with Imperfect Sampling
The goal of steganography is to pass secret messages by disguising them as innocent-looking covertexts. Real world stegosystems are often broken because they make invalid assumptions about the system’s ability to sample covertexts. We examine whether it is possible to weaken this assumption. By modeling the covertext distribution as a stateful Markov process, we create a sliding scale between r...
متن کاملEfficient Provably Secure Public Key Steganography
We construct efficient public key steganographic schemes, without resort to any special existence assumption such as unbiased functions. This is the first time such a construction is obtained. Not only our constructions are secure, but also are essentially optimal and have no error decoding. We achieve this by designing a new primitive called P-codes.
متن کاملProvably Secure Steganography and the Complexity of Sampling
Recent work on theoretical aspects of steganography resulted in the construction of oracle-based stegosystems. It has been shown that these can be made secure against the steganography equivalents of common cryptographic attacks. In this paper we use methods from complexity theory to investigate the efficiency of sampling from practically relevant types of channels. We show that there are chann...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 2009
ISSN: 0018-9340
DOI: 10.1109/tc.2008.199